Curve Detection with Dynamic Programming ( Triple - points based cost calculation ) CS 355 Project
نویسنده
چکیده
This paper presents a refined algorithm for curve detection with dynamic programming. In this advanced algorithm, the structure of the cost function is based on a triple of consecutive variables instead of pairs of consecutive indices. We give the details of the algorithm and the approach to calculate the cost by merging the prior penalty and the logposterior. Furthermore, the paper performs the efficiency comparison between this new algorithm and the one presented in the text Chap. 4 and points out both approaches advantages and disadvantages; finally, we gives some consideration about the further work aiming to gain more benefit.
منابع مشابه
Energy cost minimization in an electric vehicle solar charging station via dynamic programming
Environmental crisis and shortage of fossil fuels make Electric Vehicles (EVs) alternatives for conventional vehicles. With growing numbers of EVs, the coordinated charging is necessary to prevent problems such as large peaks and power losses for grid and to minimize charging costs of EVs for EV owners. Therefore, this paper proposes an optimal charging schedule based on Dynamic Programming (DP...
متن کاملSimulation of Store Separation using Low-cost CFD with Dynamic Meshing
The simulation of the store separation using the automatic coupling of dynamic equations with flow aerodynamics is addressed. The precision and cost (calculation time) were considered as comparators. The method used in the present research decreased the calculation cost while limiting the solution error within a specific and tolerable interval. The methods applied to model the aerodynamic force...
متن کاملFuzzy Multi-Objective Linear Programming for Project Management Decision under Uncertain Environment with AHP Based Weighted Average Method
Smooth implementation and controlling conflicting goals of a project with the usage of all related resources through organization is inherently a complex task to management. At the same time deterministic models are never efficient in practical project management (PM) decision problems because the related parameters are frequently fuzzy in nature. The project execution time is a major concern o...
متن کاملDynamic Programming and Curve Fitting Based Road Boundary Detection
This paper presents a vision based road boundary detection based on the combination of dynamic programming and 2nd order polynomial approximation. The initial estimate of the most likely road boundaries are obtained by a modified dynamic programming on a cost field defined on the edge image. A second order polynomial is fit to the initial coarse estimate of road boundaries to obtain a refined e...
متن کاملA New Mathematical Approach based on Conic Quadratic Programming for the Stochastic Time-Cost Tradeoff Problem in Project Management
In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...
متن کامل